A Splitting Property of Maximal Antichains
نویسندگان
چکیده
In every dense poset P every maximal antichain S may be partitioned into disjoint subsets S1 and S2 , such that the union of the upset of S1 with the downset of S2 yields the entire poset: U(S1) [ D(S2) = P . To nd a similar splitting of maximal antichains in posets is NP{hard in general.
منابع مشابه
Splitting finite antichains in the homomorphism order
A structural condition is given for finite maximal antichains in the homomorphism order of relational structures to have the splitting property. It turns out that non-splitting antichains appear only at the bottom of the order. Moreover, we examine looseness and finite antichain extension property for some subclasses of the homomorphism poset. Finally, we take a look at cut-points in this order.
متن کاملOn Finite Maximal Antichains in the Homomorphism Order
The relation of existence of a homomorphism on the class of all relational structures of a fixed type is reflexive and transitive; it is a quasiorder. There are standard ways to transform a quasiorder into a partial order – by identifying equivalent objects, or by choosing a particular representative for each equivalence class. The resulting partial order is identical in both cases. Properties ...
متن کاملAntichains in the homomorphism order of graphs
Denote by G and D, respectively, the the homomorphism poset of the finite undirected and directed graphs, respectively. A maximal antichain A in a poset P splits if A has a partition (B, C) such that for each p ∈ P either b ≤P p for some b ∈ B or p ≤p c for some c ∈ C. We construct both splitting and non-splitting infinite maximal antichains in G and in D. A point y ∈ P is a cut point in a pose...
متن کاملLIMIT AVERAGE SHADOWING AND DOMINATED SPLITTING
In this paper the notion of limit average shadowing property is introduced for diffeomorphisms on a compact smooth manifold M and a class of diffeomorphisms is given which has the limit average shadowing property, but does not have the shadowing property. Moreover, we prove that for a closed f-invariant set Lambda of a diffeomorphism f, if Lambda is C1-stably limit average shadowing and t...
متن کاملMaximal Antichain Lattice Algorithms for Distributed Computations
The lattice of maximal antichains of a distributed computation is generally much smaller than its lattice of consistent global states. We show that a useful class of predicates can be detected on the lattice of maximal antichains instead of the lattice of consistent cuts obtaining significant (exponential for many cases) savings. We then propose new online and offline algorithms to construct an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorica
دوره 15 شماره
صفحات -
تاریخ انتشار 1995